翻訳と辞書 Words near each other ・ Bend and Break ・ Bend Arch–Fort Worth Basin ・ Bend Bandits ・ Bend Beyond ・ Bend City, California ・ Bend Elks ・ Bend Glacier ・ Bend Group ・ Bend Her ・ Bend in the Road ・ Bend It Like Beckham ・ Bend It Like Beckham the Musical ・ Bend It Until It Breaks ・ Bend Me, Shape Me ・ Bend Me, Shape Me (album) ・ Bend minimization ・ Bend Municipal Airport ・ Bend of Islands, Victoria ・ Bend of the Lane ・ Bend of the River ・ Bend Or ・ Bend Ova ・ Bend over ・ Bend Over Boyfriend ・ Bend Park & Recreation District ・ Bend Radio Group ・ Bend radius ・ Bend railway station ・ Bend Rainbows ・ Bend Road archaeological site Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Bend minimization ： ウィキペディア英語版 Bend minimization In graph drawing styles that represent the edges of a graph by polylines (sequences of line segments connected at bends), it is desirable to minimize the number of bends per edge (sometimes called the curve complexity)〔.〕 or the total number of bends in a drawing.〔.〕 Bend minimization is the algorithmic problem of finding a drawing that minimizes these quantities.〔, p. 145.〕〔.〕 ==Eliminating all bends== The prototypical example of bend minimization is Fáry's theorem, which states that every planar graph can be drawn with no bends, that is, with all its edges drawn as straight line segments.〔, p. 140.〕 Drawings of a graph in which the edges are both bendless and axis-aligned are sometimes called ''rectilinear drawings'', and are one way of constructing RAC drawings in which all crossings are at right angles.〔 However, it is NP-complete to determine whether a planar graph has a planar rectilinear drawing,〔.〕 and NP-complete to determine whether an arbitrary graph has a rectilinear drawing that allows crossings.〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Bend minimization」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.